Domination Analysis in Combinatorial Optimization
نویسنده
چکیده
BackgroundGame Theory Interpretation MethodsRandomizationFunctional Lagrange Multipliers ConclusionsReferences
منابع مشابه
Domination Analysis of Combinatorial Optimization Algorithms and Problems
We provide an overview of an emerging area of domination analysis (DA) of combinatorial optimization algorithms and problems. We consider DA theory and its relevance to computational practice.
متن کاملDomination analysis of combinatorial optimization problems
We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results proved already in the 1970’s that min TSP (both symmetric and asymmetric versions) is DOM-easy. We prove that several CO problems are DOM-easy including weighted max k-SAT and max cut. W...
متن کاملDomination Analysis in Combinatorial Optimization
Exact algorithms allow one to find optimal solutions to NP-hard combinatorial optimization (CO) problems. Many research papers report on solving large instances of some NPhard problems (see, e.g., [25, 27]). The running time of exact algorithms is often very high for large instances (many hours or even days), and very large instances remain beyond the capabilities of exact algorithms. Even for ...
متن کاملIntroduction to Domination Analysis
In the recently published book on the Traveling Salesman Problem, half of Chapter 6 [18] is devoted to domination analysis (DA) of heuristics for the Traveling Salesman Problem. Another chapter [16] is a detailed overview of the whole area of DA. Both chapters are of considerable length. The purpose of this paper is to give a short introduction to results and applications of DA. While we do not...
متن کاملDomination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P . The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obtained by A for any instance I of P of size s is not worse than at least the fraction q of the feasible solutions of I. We say that P admits an Asymptotic Domination Ratio One (ADRO) algorithm if there is a polynomial ...
متن کامل